Memoryless computation: New results, constructions, and extensions
نویسندگان
چکیده
منابع مشابه
Memoryless computation: New results, constructions, and extensions
In this paper, we generalise the famous algorithm for swapping the contents of two variables without using a buffer. We introduce a novel combinatorial framework for procedural programming languages, where programs are only allowed to update one variable at a time. We first consider programs which do not have any memory. We prove that any function of all the variables can be computed this way i...
متن کاملa new algorithm and software of individual life insurance and annuity computation
چکیده ندارد.
15 صفحه اولC-loops: Extensions and Constructions
C-loops are loops satisfying the identity x(y · yz) = (xy · y)z. We develop the theory of extensions of C-loops, and characterize all nuclear extensions provided the nucleus is an abelian group. C-loops with central squares have very transparent extensions; they can be built from small blocks arising from the underlying Steiner triple system. Using these extensions, we decide for which abelian ...
متن کاملGeometric Constructions and Algebraic Field Extensions
In this paper, we study field extensions obtained by polynomial rings and maximal ideals in order to determine whether solutions exist to three ancient Greek construction problems: squaring the circle, doubling the cube, and trisecting an angle.
متن کاملCentral extensions and generalized plus-constructions
We describe the effect of homological plus-constructions on the homotopy groups of Eilenberg-MacLane spaces in terms of universal central extensions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.09.040